Vaught's conjecture for unidimensional theories
نویسندگان
چکیده
In Bue93b] we proved Vaught's conjecture for all superstable theories of nite rank; that is, such a theory has countably many or continuum many countable models. While this proof does settle Vaught's conjecture for unidimensional theories a sharper result can be obtained for these theories and in places the proof can be simpliied. Let T be a properly unidimensional theory with < 2 @ 0 many countable models. First, we prove for T what is called the Tree Theorem. Loosely, it says that a countable model M is almost atomic over a set t(M) M on which there is a partial order such that (t(M);) is a tree and, for a 2 t(M); tp(a=fb 2 t(M) : b ag) has U ? rank 1 and nite multiplicity. This leads to a characterization of the possible structure groups (see Bue93b]). In particular, one set of conditions in which a superstable theory of nite rank can have continuum many models is eliminated for unidimensional theories. 1 Preliminaries Vaught's conjecture says that a countable rst order theory has countably many or 2 @ 0 many countable models. A theory is unidimensional if all nonalgebraic types are nonorthogonal. Vaught's conjecture for superstable theories of nite rank was proved in Bue93b], of which this paper is a sequel. The purpose of this paper is twofold. First, the unidimensional hypothesis leads to sharper results. Speciically, we will give a precise characterization of the possible structure groups and prove that the corresponding class of abelian structures always has nite representation type (see Bue93b, x6]). The author wishes to thank Ludomir Newelski for many helpful conversations on the reuslts in this paper and for nding errors in some earlier proofs.
منابع مشابه
Vaught's conjecture for superstable theories of nite rank
In this paper we prove Vaught's conjecture for superstable theories in which each complete type has nite U? rank. The general idea is to associate with the theory an V ? deenable group G (called the structure group) which controls the isomorphism types of the models. We use module theory to show that when the theory has few countable models and M is a countable model there is a nice decompositi...
متن کامل5 Counterexamples to Vaught ’ s Conjecture
A sentence σ ∈ L ω1,ω is a counterexample to Vaught's Conjecture, or simply a counterexample, if ℵ 0 < I(σ, ℵ 0) < 2 ℵ0 , i.e., σ has uncountably many countable models but fewer than continuum many models. Fix σ a counterexample. A key fact about counterexamples is that there are few types for any count-able fragment. Let F be a fragment. Let
متن کاملVaught's Conjecture Without Equality
Suppose σ ∈ Lω1,ω(L) is such that all equations occurring in σ are positive, have the same set of variables on each side of the equality symbol, and have at least one function symbol on each side of the equality symbol. We show that σ satisfies Vaught’s conjecture. In particular this proves Vaught’s conjecture for sentences of Lω1,ω(L) without equality.
متن کاملVaught's conjecture for superstable theories of finite rank
In [Vau61] Vaught conjectured that a countable first order theory has countably many or 2א0 many countable models. Here, the following special case is proved. Theorem. If T is a superstable theory of finite rank with < 2א0 many countable models, then T has countably many countable models. The basic idea is to associate with a theory a ∧ − definable group G (called the structure group) which con...
متن کاملPure Computable Model Theory
2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. Introduction History Notation and basic definitions Decidable theories, and computable and decidable models Effective completeness theorem Model completeness and decidability Omitting types and decidability Decidable prime models Computable saturated models and computably saturated models Decidable homogeneous models Vaught's theorem computabl...
متن کامل